Network design: taxi planning
نویسندگان
چکیده
The effect of managing aircraft movements on the airport's ground is an important tool that can alleviate the delays of flights, specially in peak hours or congested situations. Although some strategic design decisions regarding aeronautical and safety aspects have a main impact on the airport's topology, there exists a number of other additional factors that must be evaluated according to the on ground operations, i.e. previous to the taking-off or after landing. Among these factors one can consider capacities at waiting points and directions of some corridors. These factors are related to the demand situation of a given period and influence the aircraft's routing on the ground or short term Taxi Planning problem (or TP-S). While the TP-S problem studies the aircraft routing and scheduling on the airport's ground under a dynamic point of view, this paper presents a Taxi Planning network design model (or TPND), attending to these additional factors of the airport's topology and the conflicting movements of the aircraft on them with the same modelling approach used in the TP-S problem. The TPND model is formulated as a binary multicommodity network flow problem with additional side constraints under a multiobjective approach. The side constraints included are the classical limitations due to capacity and also as a distinctive approach, constraints that restrict the interference of aircraft in order to decrease the intervention of human controllers during the operations or increase their safety margins. The multiobjective approach adopted for the TPND model balances conflicting objectives: airport's throughput, travel times, safety of operations and costs. In the paper computational results are included on two test airports solving the TPND model by "Branch and Bound" showing the effect of the conflicting objectives in the design decisions.
منابع مشابه
Path-finding through flexible hierarchical road networks: An experiential approach using taxi trajectory data
Optimal paths computed by conventional path-planning algorithms are usually not “optimal” since realistic traffic information and local road network characteristics are not considered. We present a new experiential approach that computes optimal paths based on the experience of taxi drivers by mining a huge number of floating car trajectories. The approach consists of three steps. First, routes...
متن کاملRevealing daily travel patterns and city structure with taxi trip data
Detecting regional spatial structures based on spatial interactions is crucial in applications ranging from urban planning to traffic control. In the big data era, various movement trajectories are available for studying spatial structures. This research uses large scale Shanghai taxi trip data extracted from GPS-enabled taxi trajectories to reveal traffic flow patterns and urban structure of t...
متن کاملMeasuring the Efficiency of Urban Taxi Service System
The taxi service systems in big cities are immensely complex due to the interaction and self-organization between taxi drivers and passengers. An inefficient taxi service system leads to more empty trips for drivers and longer waiting time for passengers, and introduces unnecessary congestion to road network. Although understanding the performance of urban taxi service system is important, the ...
متن کاملOptimal Airport Surface Traffic Planning Using Mixed-Integer Linear Programming
We describe an ongoing research effort pertaining to the development of a surface traffic automation system that will help controllers to better coordinate surface traffic movements related to arrival and departure traffic. More specifically, we describe the concept for a taxi-planning support tool that aims to optimize the routing and scheduling of airport surface traffic in such a way as to d...
متن کاملRouting and scheduling for deployment of vessels for one of the world’s leading RoRo carriers
Transportation of cars by sea is mainly performed by specialized vessels. These vessels are purpose built for transporting cars and trucks, but some also transport other rolling equipment (high and heavy) and non-containerized cargo (break bulk). In this paper we introduce a routing and scheduling problem for deployment of the fleet of roll-on roll-off (RoRo) vessels. This problem is based on a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 157 شماره
صفحات -
تاریخ انتشار 2008